# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def lengthOfLastWord(self, s: str) -> int:
        s_len = len(s)
        first_index = -1
        ans = 0

        for i in range(s_len - 1, -1, -1):
            if s[i] != ' ' and first_index == -1:
                first_index = i
            elif s[i] == ' ' and first_index != -1:
                ans = first_index - i
                break

        if ans == 0 and first_index != -1:
            ans = first_index + 1

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (" a b", 1),
        ("a", 1),
        (" a ", 1),
        (" a b ", 1)

    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.lengthOfLastWord(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

